The structural variability of quarters and residential areas in the historical texture of the city of Yazd based on Islamic rules and jurisprudence: a case study of Golchinan quarter

According to many researchers and scholars, religious beliefs can be considered as the most influential factor in forming Muslim urban spaces and their architectural elements. In fact, historical cities reflect the culture and beliefs of their residences. Among all historical places in Iranian cities, the historical texture of the city of Yazd, especially the quarters since the age of Qajar dynasty, are well preserved. The present study aims at identifying the Islamic principles and values influencing the formation of architectural spaces and the extent of their applications in one of the historical quarters known as Golchinan. The results of the conformation of the theoretical findings with the data acquired from field studies revealed that almost 90% of the urban and architectural spaces (e.g. residential areas, mosques, bazaars, and pathways) in Yazd are directly influenced by Islamic principles. In other words, there is a strong conformity between the accepted Islamic values of the society and what actually was applied to urban constructions during Qajar dynasty.     

Title加TextRank抽取关键句的情感分类研究

考虑到不同句子对判断文档情感倾向的重要程度不同，因而区分文档的关键句和细节句将有助于提高情感分类的性能。同时，考虑到Title和上下文信息，提出了一种基于Title和加权TextRank抽取关键句的情感分析方法SKTT，实现了高效的情感分析。根据文档Title的情感权重计算Title贡献度，考虑到标点和语义规则对情感倾向的影响；根据加权TextRank算法思想，在文档正文中构建了一个情感句有向图来提取关键句；计算所有关键句的情感倾向进行情感分类。在4个领域上进行实验，实验结果表明，该SKTT方法性能明显优于Baseline，具有高效性。     

基于改进蚁群算法的三维路径规划

针对移动机器人在海水环境中的三维路径规划问题容易陷入局部最优和收敛慢等瑕疵，根据三维环境全局信息来改进蚁群算法以提高实时性和收敛速度。改进蚁群算法的启发函数，采用局部信息和全局信息结合动态地改进信息素更新方式，以及根据三维空间中路径的平坦程度和光滑度二阶微分分别增加了一阶微分和二阶微分来再次修改信息素更新规则。仿真对比实验结果显示改进后的蚁群算法克服了收敛速度慢、容易陷入局部最优的缺点。     

Discovery of path-attribute dependency in manufacturing environments: A process mining approach

The more knowledge industrial practitioners detain of their production processes, the more they are capable of performing process improvements. Nonetheless, there may exist process characteristics and dependencies that are not easily extractable from business models, such as routing dependent attributes. This paper introduces an algorithm-driven framework to establish whether process path decisions influence the attributes in non-direct sequences, e.g., deploying machine A instead of machine B affects the % of rejected parts on the process, 4 stages down the line. This problem is shown to bears similarities with sequential pattern mining problems. The basis of the solution framework relies on process mining and data mining techniques. The approach proposed is applied on a real industrial log, unveiling deficiencies in the system and providing further improvement recommendations.     

水产品及养殖水中丁香酚类化合物风险研究

目的 检测水产品及养殖水中丁香酚类化合物。方法 应用食品补充检验方法BJS 201908《水产品及水中丁香酚类化合物的测定》，以海水鱼、淡水鱼、海水虾、淡水虾及养殖水作为基质，测定6种丁香酚类化合物的含量。结果 通过对实际样品测定后发现，在水产品中检出了丁香酚类化合物，主要为丁香酚，检出率为28.9%，其中海水鱼相对突出。结论 本研究为丁香酚作为渔用麻醉剂提供了方法论，为丁香酚类化合物在水产运输的合理使用提供理论依据。     

Neural network based non-invasive method to detect anemia from images of eye conjunctiva

Detection of anemia can be done by examining the hemoglobin concentration level in the blood using complete blood count, which is an invasive, time-consuming, and costly technique. Preliminary methods for detecting anemia include examining the color of the palpebral conjunctiva, which is a non-invasive method, but color perception may vary from person to person. This study aims to develop a computerized non-invasive technique for anemia detection. We propose a novel machine learning model using the artificial neural network to detect anemic patients from the images of eye conjunctiva. Since limited and small dataset has been used in the earlier approaches, this may cause over fitting of the model. We have improved the number of available training images using image augmentation techniques. To standardize a non-invasive method, we have used computer vision algorithms for preprocessing and feature extraction. This article derives the backpropagation rules mathematically for adjusting the weights for the proposed neural network model. After hyper parameter tuning and using the mathematically derived backpropagation rules, the model was able to achieve the best accuracy of 97.00% with sensitivity 99.21% and specificity 95.42% on the created dataset.     

基于数据驱动理念的电力日负荷曲线预测方法研究

针对短期日负荷预测的精度问题,本文提出一种基于数据驱动理念的电力负荷预测方法。在建立预测模型前对所给数据采取一定的预处理:首先提取所收集的海量数据的负荷特征,对负荷特征进行分析,然后进行负荷数据与影响负荷值的因素之间的相关性分析,以此确定对负荷影响较密切的因素,随后建立分类器得到各主要影响因素与各负荷类别之间的关系为后续预测模型奠定基础。对预处理后得到的不同类型的负荷数据采用最小二乘支持向量机方法建立不同的负荷预测模型。以南方某发达城市2008年的负荷数据作为算例验证数据,将本文所提负荷预测方法所得结果与未经数据预处理的负荷预测方法所得结果进行比较,结果表明本文提出的方法得到的预测结果精度较传统方法提高约6%。     

Hierarchical multi-reservoir optimization modeling for real-world complexity with application to the Three Gorges system

High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 10⁷ m³ less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators.     

Balancing of parallel U-shaped assembly lines

A new hybrid assembly line design, called parallel U-shaped assembly line system, is introduced and characterised along with numerical examples for the first time. Different from existing studies on U-shaped lines, we combine the advantages of two individual line configurations (namely parallel lines and U-shaped lines) and create an opportunity for assigning tasks to multi-line workstations located in between two adjacent U-shaped lines with the aim of maximising resource utilisation. Utilisation of crossover workstations, in which tasks from opposite areas of a same U-shaped line can be performed, is also one of the main advantages of the U-shaped lines. As in traditional U-shaped line configurations, the newly proposed line configuration also supports the utilisation of crossover workstations. An efficient heuristic algorithm is developed to find well-balanced solutions for the proposed line configurations. Test cases derived from existing studies and modified in accordance with the proposed system in this study are solved using the proposed heuristic algorithm. The comparison of results obtained when the lines are balanced independently and when the lines are balanced together (in parallel to each other) clearly indicates that the parallelisation of U-shaped lines helps decrease the need for workforce significantly.     

Testing local search move operators on the vehicle routing problem with split deliveries and time windows

The vehicle routing problem (VRP) is an important transportation problem. The literature addresses several extensions of this problem, including variants having delivery time windows associated with customers and variants allowing split deliveries to customers. The problem extension including both of these variations has received less attention in the literature. This research effort sheds further light on this problem. Specifically, this paper analyzes the effects of combinations of local search (LS) move operators commonly used on the VRP and its variants. We find when paired with a MAX-MIN Ant System constructive heuristic, Or-opt or 2-opt⁎ appear to be the ideal LS operators to employ on the VRP with split deliveries and time windows with Or-opt finding higher quality solutions and 2-opt⁎ requiring less run time.